PRISM

Benchmark
Model:eajs v.1 (MDP)
Parameter(s)N = 6, energy_capacity = 300, B = 13
Property:ExpUtil (exp-reward)
Invocation (specific)
./fix-syntax ./prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 eajs.6.prism eajs.props --property ExpUtil -const energy_capacity=300,B=13
Execution
Walltime:67.3196051120758s
Return code:0
Relative Error:5.674533047156748e-09
Log
PRISM
=====

Version: 4.5.dev
Date: Sat Mar 14 17:18:38 UTC 2020
Hostname: e72bdd194fc5
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 eajs.6.prism eajs.props_fixed --property ExpUtil -const 'energy_capacity=300,B=13'

Parsing model file "eajs.6.prism"...

Type:        MDP
Modules:     Battery Process_1 Process_2 Resources Process_3 Process_4 Process_6 Process_5 
Variables:   battery_load failure_1 loc_1 t_1 t_2 loc_2 boost_1 user_1 t_3 loc_3 t_4 loc_4 loc_6 t_6 t_5 loc_5 

Parsing properties file "eajs.props_fixed"...

1 property:
(1) "ExpUtil": R{"utilityLocal"}max=? [ F emptyBattery ]

---------------------------------------------------------------------

Model checking: "ExpUtil": R{"utilityLocal"}max=? [ F emptyBattery ]
Model constants: energy_capacity=300

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...
Model constants: energy_capacity=300

Computing reachable states...

Reachability (BFS): 89 iterations in 0.27 seconds (average 0.002989, setup 0.00)

Time for model construction: 1.342 seconds.

Type:        MDP
States:      7901694 (1 initial)
Transitions: 19722777
Choices:     11897412

Transition matrix: 38911 nodes (7 terminal), 19722777 minterms, vars: 50r/50c/5nd

Prob0E: 300 iterations in 0.94 seconds (average 0.003140, setup 0.00)

Prob1A: 1 iterations in 0.01 seconds (average 0.008000, setup 0.00)

goal = 28620, inf = 0, maybe = 7873074

Computing remaining rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=7901694, nc=11854302, nnz=19651307, k=12] [300.3 MB]
Building sparse matrix (transition rewards)... [n=7901694, nc=11854302, nnz=257760, k=12] [78.3 MB]
Creating vector for state rewards... [60.3 MB]
Creating vector for inf... [60.3 MB]
Allocating iteration vectors... [2 x 60.3 MB]
TOTAL: [619.7 MB]

Starting iterations...
Iteration 25: max relative diff=0.203774, 5.12 sec so far
Iteration 48: max relative diff=0.065179, 10.18 sec so far
Iteration 72: max relative diff=0.034539, 15.37 sec so far
Iteration 96: max relative diff=0.021704, 20.42 sec so far
Iteration 121: max relative diff=0.015002, 25.55 sec so far
Iteration 147: max relative diff=0.002067, 30.74 sec so far

Iterative method: 153 iterations in 64.30 seconds (average 0.208647, setup 32.37)

Value in the initial state: 12.05111075489705

Time for model checking: 65.205 seconds.

Result: 12.05111075489705 (value in the initial state)


Overall running time: 67.146 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.